A sufficient condition to polynomially compute a minimum separating DFA
نویسندگان
چکیده
منابع مشابه
A sufficient condition to polynomially compute a minimum separating DFA
The computation of a minimal separating automaton (MSA) for regular languages has been studied from many different points of view, from synthesis of automata or Grammatical Inference to the minimization of incompletely specified machines or Compositional Verification. In the general case, the problem is NP-complete, but this drawback does not prevent the problem from having a real application i...
متن کاملA Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کاملSimple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference Both exact and approximate in the PAC sense identi ability of DFA from examples is known to be hard Pitt in his semi nal paper posed the following open research problem Are DFA PAC identi able if ex amples are drawn from the uniform distribu tion or some other known simple distribu tion Pitt We demonstrate that t...
متن کاملA Sufficient Condition for Hyperinvariance
A linear transformation on a finite-dimensional complex linear space has the property that all of its invariant subspaces are hyperinvariant if and only if its lattice of invariant subspaces is distributive [1]. It is shown that an operator on a complex Hilbert space has this property if its lattice of invariant subspaces satisfies a certain distributivity condition. 1. Preliminaries. Throughou...
متن کاملA sufficient condition for equality of arc-connectivity and minimum degree of a diagraph
Let D be a simple digraph with order p, strong arc-connectivity A(D) and minimum degree 6(D). It is shown here that in order to obtain the equality A.(II)=&D), it is sufficient that there are LjpJ pairs of vertices xj,yi in D such that d,(xi)+dD(yi)>p (i=1,2,...,L$pJ). This is a generalization of a theorem of Goldsmith and White (1978) for graphs. Goldsmith and White [l] proved the following th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2016
ISSN: 0020-0255
DOI: 10.1016/j.ins.2016.07.053